SoK: Efficient Privacy-preserving Clustering

نویسندگان

چکیده

Abstract Clustering is a popular unsupervised machine learning technique that groups similar input elements into clusters. It used in many areas ranging from business analysis to health care. In of these applications, sensitive information clustered should not be leaked. Moreover, nowadays it often required combine data multiple sources increase the quality as well outsource complex computation powerful cloud servers. This calls for efficient privacy-preserving clustering. this work, we systematically analyze state-of-the-art We implement and benchmark today’s four most fully private clustering protocols by Cheon et al. (SAC’19), Meng (ArXiv’19), Mohassel (PETS’20), Bozdemir (ASIACCS’21) with respect communication, computation, quality. compare them, assess their limitations practical use real-world conclude open challenges.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Communication-Efficient Privacy-Preserving Clustering

The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well as regulations, often prevent the sharing of data between multiple parties. Privacy-preserving distributed data mining allows the cooperative computation of data mining algorithms without requiring the participating o...

متن کامل

Privacy-preserving distributed clustering

Clustering is a very important tool in data mining and is widely used in on-line services for medical, financial and social environments. The main goal in clustering is to create sets of similar objects in a data set. The data set to be used for clustering can be owned by a single entity, or in some cases, information from different databases is pooled to enrich the data so that the merged data...

متن کامل

Privacy Preserving Clustering

The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together. Clustering has many applications, such as customerbehavior analysis, targeted marketing, forensics, and bioinformatics. In this paper, we present the design and analysis of a privacy-preserving k-means clustering algo...

متن کامل

Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing

In this paper, we propose a privacy preserving distributed clustering protocol for horizontally partitioned data based on a very efficient homomorphic additive secret sharing scheme. The model we use for the protocol is novel in the sense that it utilizes two non-colluding third parties. We provide a brief security analysis of our protocol from information theoretic point of view, which is a st...

متن کامل

Privacy preserving clustering with constraints

The k-center problem is a classical combinatorial optimization problem which asks to find k centers such that the maximum distance of any input point in a set P to its assigned center is minimized. The problem allows for elegant 2-approximations. However, the situation becomes significantly more difficult when constraints are added to the problem. We raise the question whether general methods c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings on Privacy Enhancing Technologies

سال: 2021

ISSN: ['2299-0984']

DOI: https://doi.org/10.2478/popets-2021-0068